Notable historical databases of fungal names

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bailey and Bishop's Notable Names in Medicine and Surgery

to the locus of the Vice Voce was justifiable. In this book lies diversion from the most wearisome of vivas. Grab the chance: the next question is almost certainly, Tell me, why are Thromboxane, Testicular Teratomas or Tapeworms of importance today?' For sensible souls not contemplating examination encounters this book offers wider philosophical enquiry. Hamilton Bailey's own life style is clea...

متن کامل

Searching Proper Names in Databases

Identifying names — e.g., author names or company names — is still an open problem. In this paper we review known similarity measures. These measures deal with phonetic similarity, typing errors and plain string similarity. We show experimentally that all three approaches lead to significant better retrieval quality than plain identity. Furthermore, we demonstrate that combinations of different...

متن کامل

Expiration of Historical Databases

We present a technique for automatic expiration of data in a historical data warehouse that preserves answers to a known and fixed set of first-order queries. In addition, we show that for queries with output size bounded by a function of the active data domain size (the number of values that have ever appeared in the warehouse), the size of the portion of the data warehouse history needed to a...

متن کامل

Temporal Logic & Historical Databases

We review attempts at defining a general extension to the relational algebra to incl udc temporal semantics, and dcfinc two temporal operators to achieve a temporal relational algebra with a close correspondence to temporal logic using since and until. We then dcmonstratc how this temporal relational algebra may IO ;I limited extent be encoded in standard rclaticlnal algebra, and in turn show h...

متن کامل

Linking Databases using Matched Arabic Names

In this paper, a new hybrid algorithm that combines both token-based and character-based approaches is presented. The basic Levenshtein approach also has been extended to the token-based distance metric. The distance metric is enhanced to set the proper granularity level behavior of the algorithm. It smoothly maps a threshold of misspelling differences at the character level and the importance ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IMA Fungus

سال: 2016

ISSN: 2210-6359

DOI: 10.1007/bf03449412